Combining Machine Learning with Evolutionary Computation: Recent Results on LEM
نویسندگان
چکیده
The Learnable Evolution Model (LEM), first presented at the Fourth International Workshop on Multistrategy Learning, employs machine learing to guide evolutionary computation . Specifically, LEM integrates two modes of operation: Machine Learning mode, which employs a machine learning algorithm, and Darwinian Evolution mode, which employs a conventional evolutionary algorithm. The central new idea of LEM is that in machine lear ning mode, new individuals are “genetically engineered” by a repeated process of hypothesis formation and instantiation, rather than created by random operators of mutation and/or recombination, as in Darwinian -type evolutionary algorithms. At each stage o f evoluation, hypotheses are induced by a machine learning system from examples of high and low performance individuals. New individuals are created by instantiating the hypotheses in different ways. In recent experiments concerned with complex function op timization problems, LEM has signif icantly outperformed selected evolutionary computation a lgorithms, sometimes achieving speed -ups of the evolutionary process by two or more orders of magnitude (in terms of the number of generations). In another recent application involving a problem of optimizing heat exchangers, LEM produced designs equal or superior to best expert designs. The recent results have confirmed earlier findings that LEM is able to significantly speed-up evolutionary processes (in terms of the number of generations) for certain problems. Further research is needed to determine classes of problems for which LEM is most advantagious. .
منابع مشابه
Speeding Up Evolution through Learning: LEM
This paper reports briefly on the development of a new approach to evolutionary computation, called the Learnable Evolution Model or LEM. In contrast to conventional Darwinian-type evolutionary algorithms that employ mutation and/or recombination, LEM employs machine learning to generate new populations. At each step of evolution, LEM determines hypotheses explaining why certain individuals in ...
متن کاملData-driven Constructive Induction in the Learnable Evolution Model
The learnable evolution model (LEM) is a non-Darwinian evolutionary computation method which applies symbolic machine learning to guide the evolutionary optimization process. This paper investigates application of data-driven constructive induction to automatically improve representation spaces in LEM. This includes investigation of methods for modifying representation spaces and methods for cr...
متن کاملApplying Learnable Evolution Model to Heat Exchanger Design
A new approach to evolutionary computation, called Learnable Evolution Model (LEM), has been applied to the problem of optimizing tube structures of heat exchangers. In contrast to conventional Darwiniantype evolutionary computation algorithms that use various forms of mutation and/or recombination operators, LEM employs machine learning to guide the process of generating new individuals. A sys...
متن کاملThe LEM3 System for Non-Darwinian Evolutionary Computation and Its Application to Complex Function Optimization
LEM3 is the newest implementation of Learnable Evolution Model (LEM), a non-Darwinian evolutionary computation methodology that employs machine learning to guide evolutionary processes. Due to a deep integration of different modes of operation and the use of the advanced machine learning system AQ21, the LEM3 system is a highly efficient and effective implementation of the methodology. LEM3 sup...
متن کاملThe LEM3 System for Multitype Evolutionary Optimization
LEM3 is the newest version of the learnable evolution model (LEM), a non-Darwinian evolutionary computation methodology that employs machine learning to guide evolutionary processes. Due to the deep integration of different modes of operation, several novel elements in its algorithm, and the use of the advanced machine learning system AQ21, the LEM3 system is a highly efficient and effective im...
متن کامل